Hybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage

Authors

Abstract:

In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, decision makers not only need to determine the processing sequences on machines in first stage, but also need to assign each product to a machine and determine the assembly sequences of the products in second stage and the sub-lot sizes of all jobs and products to minimize the makespan. At first, this problem is modeled as a mixed integer linear programming and GAMS software is applied to solve small problems. Since this problem is classified as NP-hard, four hybrid algorithms based on iterative procedures are suggested to solve the problem in medium and large dimensions. In order to verify the effectiveness of the proposed algorithms, a statistical analysis is used along with Relative Percentage Deviation (RPD) factor. Computational results revealed that the hybrid genetic and parallel simulated annealing algorithm (HGAPSA) and the hybrid genetic and parallel variable neighborhood search algorithm (HGAPVNS) perform better than the other proposed algorithms with respect to the objective function. Also, considering lot streaming for both stages instead of applying it only to the first stage leads to achieve better solutions. Finally, the HGAPSA algorithm is compared with a hybrid genetic algorithm (HGA). Experimental results showed that the HGAPSA outperforms the HGA in terms of solution quality.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Customer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop

This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...

full text

A resource-constrained assembly job shop scheduling problem with Lot Streaming technique

To ensure effective shop floor production, it is vital to consider the capital investment. Among most of the operational costs, resource must be one of the critical cost components. Since each operation consumes resources, the determination of resource level is surely a strategic decision. For the first time, the application of Lot Streaming (LS) technique is extended to a Resource-Constrained ...

full text

Lot Streaming in Hybrid Flow Shop Scheduling

Production planning and scheduling play significant roles in manufacturing system operations and different techniques have been used to enhance their performance. Lot streaming has been studied for decades and is shown to accelerate production flow. This research deals with lot streaming in hybrid flow shops. Multiple products are processed in a multi-stage hybrid flow shop with non-identical m...

full text

A multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation

Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...

full text

A New model for integrated lot sizing and scheduling in flexible job shop problem

In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...

full text

A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times

This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div> times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditiona...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 10  issue 3

pages  92- 112

publication date 2017-09-23

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023